Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity
نویسندگان
چکیده
منابع مشابه
Sufficiency and Duality in Multiobjective Programming with Generalized (f, Ρ)-convexity
A multiobjective nonlinear programming problem is considered. Sufficiency theorems are derived for efficient and properly efficient solutions under generalized (F, ρ)-convexity assumptions. Weak, strong and strict converse duality theorems are established for a general Mond–Weir type dual relating properly efficient solutions of the primal and dual problems.
متن کاملOptimality and duality for the multiobjective fractional programming with the generalized (F,ρ) convexity
A class of multiobjective fractional programmings (MFP) are first formulated, where the involved functions are local Lipschitz and Clarke subdifferentiable. In order to deduce our main results, we give the definitions of the generalized (F,ρ) convex class about the Clarke subgradient. Under the above generalized convexity assumption, the alternative theorem is obtained, and some sufficient and ...
متن کاملMixed type duality for multiobjective variational problems with generalized (F,ρ)-convexity
A mixed type dual for multiobjective variational problems is formulated. Several duality theorems are established relating properly efficient solutions of the primal and dual variational problems under generalized (F,ρ)-convexity. Static mixed type dual multiobjective problems are particular cases of these problems. 2004 Elsevier Inc. All rights reserved.
متن کاملSecond order (F, α, ρ, d)-convexity and duality in multiobjective programming
A class of second order (F,a,q,d)-convex functions and their generalizations is introduced. Using the assumptions on the functions involved, weak, strong and strict converse duality theorems are established for a second order Mond–Weir type multiobtive dual. 2005 Elsevier Inc. All rights reserved.
متن کاملSecond Order Duality in Multiobjective Programming With Generalized Convexity
The purpose of this paper is concerned with a class of multi objective programming problems in which the objective functions and constrained functions are twice differentiable and containing the support functions of a compact convex set. For such mathematic programming, to deal with its dual problem, first, the concept of second order ( , ) B p r invexity is introduced. Further, the Mangasa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Analysis
سال: 2005
ISSN: 1425-6908,1869-6082
DOI: 10.1515/jaa.2005.19